Summary of talks and papers at ISCB-Asia/SCCG 2012
نویسندگان
چکیده
منابع مشابه
Summary of papers presented at the 2012 seventh international cough symposium
Twenty six papers were presented as posters in the Seventh International Symposium on Cough; 12 papers were presented in the Basic Science of Cough session, and 14 papers presented in the Clinical Science of Cough session. These papers explored a wide spectrum of cough-related areas including pathophysiological mechanisms, treatment and detection of cough, and symptom assessment and perception,...
متن کاملSummary of Research Papers
In this article, the core results of the author’s papers are summarized. The author’s work has been carried out mainly on the finite field analogues of classical problems in harmonic analysis, geometric measure theory, and combinatorics. In particular, the author has investigated the boundedness of extension operators and the Erdős-Falconer type distance problems in the finite field setting. Th...
متن کاملSummary of WSN Papers
• Great Duck Island [SMP04]. Szewczyk et al. have used two sensor patches, gateways, base station and satellite WAN link for their experiments. A gateway node interfaces a sensor patch to the base station and consists of a mote with 14dBi high gain yagi antenna (point-to-point, directional). The base station collects the data from the sensor patches in the database and makes the data available ...
متن کاملSummary of Papers
The Kauffman NK model is a stochastic combinatorial optimization model that has been used in theoretical biology, physics and management science to model complex systems with interacting components. It could be crudely described as an optimization problem to find a maximum valued (weighted) p-nary vector of length N with the value (weight) of a vector defined in terms of its components’ weights...
متن کاملSummary of Papers
1. A new approach to the chromatic number of the square of Kneser graph K(2k + 1, k), submitted. Füredi in early 2000 proposed to determine the chromatic number χ of the square of the Kneser graph K(n, k). The problem is interesting when 2k + 1 ≤ n ≤ 3k − 2. The problem has turned out to be surprisingly difficult, and is still open even in the first case n = 2k + 1. It is believed to be χ = 2k ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Genomics
سال: 2013
ISSN: 1471-2164
DOI: 10.1186/1471-2164-14-s2-i1